On inductively minimal geometries that satisfy the intersection property
نویسندگان
چکیده
منابع مشابه
On the number of inductively minimal geometries
We count the number of inductively minimal geometries for any given rank by exhibiting a correspondence between the inductively minimal geometries of rank n and the trees with n+ 1 vertices. The proof of this correspondence uses the van Rooij–Wilf characterization of line graphs (see [11]). c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملHausdorr's Theorem for Posets That Satisfy the Nite Antichain Property
Hausdorr characterized the class of scattered linear orderings as the least family of linear orderings that includes the ordinals and is closed under ordinal summations and inversions. We formulate and prove a corresponding characterization of the class of scattered partial orderings that satisfy the nite antichain condition (FAC). Consider the least class of partial orderings containing the cl...
متن کاملModules with copure intersection property
In this paper, we investigate the modules with the copure intersection property and obtained obtain some related results.
متن کاملFamilies of polytopal digraphs that do not satisfy the shelling property
A polytopal digraph G(P ) is an orientation of the skeleton of a convex polytope P . The possible non-degenerate pivot operations of the simplex method in solving a linear program over P can be represented as a special polytopal digraph known as an LP digraph. Presently there is no general characterization of which polytopal digraphs are LP digraphs, although four necessary properties are known...
متن کاملA family of polytopal digraphs that do not satisfy the shelling property
A polytopal digraph G(P ) is an orientation of the skeleton of a convex polytope P . The possible non-degenerate pivot operations of the simplex method in solving a linear program over P can be represented as a special polytopal digraph known as an LP digraph. Presently there is no general characterization of which polytopal digraphs are LP digraphs, although four necessary properties are known...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2005
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2004.12.006